#include<iostream>
using namespace std;
#include<time.h>
#include"Priority_queue.h"

int main()
{
	srand(time(NULL));
	bit::priority_queue<int>arr;
	for (int i = 0; i < 10; i++)
	{
		arr.push(15 - i);
	}

	cout << arr.top() << endl;

	arr.pop();
	cout << arr.top() << endl;

	return 0;
}